Automated Test Case Generation with SMT-Solving and Abstract Interpretation
نویسندگان
چکیده
In this paper we describe an approach for automated modelbased test case and test data generation based on constraint types well known from bounded model checking. Our main contribution consists of a demonstration showing how this process can be considerably accelerated by using abstract interpretation techniques for preliminary explorations of the model state space. The techniques described support models for concurrent synchronous reactive systems under test with clocks and dense-time.
منابع مشابه
SAT, SMT and Applications
SAT solving has gained tremendous interest. On the practical side there have been considerable performance improvements, due to new highly efficient algorithms, new heuristics, and optimized data structures. There are new applications and reformulations of important classical problems, mainly in the context of formal methods, where SAT solving is also applied successfully in an industrial setti...
متن کاملLogical Abstract Domains and Interpretations
We give semantic foundations to abstract domains consisting in first order logic formulæ in a theory, as used in verification tools or methods using SMT-solvers or theorem provers. We exhibit conditions for a sound usage of such methods with respect to multi-interpreted semantics and extend their usage to automatic invariant generation by abstract interpretation.
متن کاملTest-Case Generation for Embedded Binary Code Using Abstract Interpretation
This paper describes a framework for test-case generation for microcontroller binary programs using abstract interpretation techniques. The key idea of our approach is to derive program invariants a priori, and then use backward analysis to obtain test vectors that are executed on the target microcontroller. Due to the structure of binary code, the abstract interpretation framework is based on ...
متن کاملSuccinct Representations for Abstract Interpretation
Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for...
متن کاملUsing widenings to infer loop invariants inside an SMT solver, or: A theorem prover as abstract domain
This paper presents a new technique for combining the inference power of abstract interpretation with the precision and flexibility of an automatic satisfiabilitymodulo-theories theorem prover.
متن کامل